MODULAR: Software for the Autonomous Computation of Modularity in Large Network Sets
نویسندگان
چکیده
Ecological systems can be seen as networks of interactions between individual, species, or habitat patches. A key feature of many ecological networks is their organization into modules, which are subsets of elements that are more connected to each other than to the other elements in the network. We introduce MODULAR to perform rapid and autonomous calculation of modularity in sets of networks. MODULAR reads a set of files with matrices or edge lists that represent unipartite or bipartite networks, and identify modules using two different modularity metrics that have been previously used in studies of ecological networks. To find the network partition that maximizes modularity, the software offers five optimization methods to the user. We also included two of the most common null models that are used in studies of ecological networks to verify how the modularity found by the maximization of each metric differs from a theoretical benchmark.
منابع مشابه
MODULARITY OF AJMAL FOR THE LATTICES OF FUZZY IDEALS OF A RING
In this paper, we construct two fuzzy sets using the notions of level subsets and strong level subsets of a given fuzzy set in a ring R. These fuzzy sets turn out to be identical and provide a universal construction of a fuzzy ideal generated by a given fuzzy set in a ring. Using this construction and employing the technique of strong level subsets, we provide the shortest and direct fuzzy set ...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملDelay-Insensitivity and Semi-Modularity
A network is delay-dense if, of each pair of adjacent components in the network, at least one is a delay. In this paper, we prove that a delay-dense asynchronous network is delay-insensitive if and only if its behavior is semi-modular. We consider autonomous networks, i.e., networks without external inputs, whose components can be any sequential machines of the Moore type. A formal model for th...
متن کاملInformation-Theoretic Methods for Modularity in Engineering Design
Due to their many advantages, modular structures commonly exist in artificial and natural systems, and the concept of modular product design has recently received extensive attention from the engineering research community. Although some work has been done on modularity, most of it is qualitative and exploratory in nature, and little is quantitative. One reason for this gap is the lack of a cle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.2917 شماره
صفحات -
تاریخ انتشار 2013